Linear extensions of orders invariant under abelian group actions
نویسندگان
چکیده
منابع مشابه
Linear Extensions of Orders Invariant under Abelian Group Actions
Let G be an abelian group acting on a set X, and suppose that no element of G has any finite orbit of size greater than one. We show that every partial order on X invariant under G extends to a linear order on X also invariant under G. We then discuss extensions to linear preorders when the orbit condition is not met, and show that for any abelian group acting on a set X, there is a G-invariant...
متن کاملEquivalence Relations Invariant under Group Actions
We study, in an abstract context, equivalence relations which are invariant under group actions. More precisely, we fix a transformation group, and we study the orbital equivalence relations (i.e. orbit equivalence relations of normal subgroups) and a wider class of weakly orbital equivalence relations. For these sorts of relations we show (under some additional assumptions) that if each class ...
متن کاملGroup Actions and Group Extensions
In this paper we study finite group extensions represented by special cohomology classes. As an application, we obtain some restrictions on finite groups which can act freely on a product of spheres or on a product of real projective spaces. In particular, we prove that if (Z/p)r acts freely on (S1)k , then r ≤ k.
متن کاملLinear Extensions of N-free Orders
We consider the number of linear extensions of an N-free order P . We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The algorithm is polynomial if a new parameter called activity is bounded by a constant. The activity can be bounded in terms of parameters of the arc diagram....
متن کاملAggregate Functions, Conservative Extensions, and Linear Orders
1 Summary Practical database query languages are usually equipped with some aggregate functions. For example, \\nd mean of column" can be expressed in SQL. However, the manner in which aggregate functions were introduced in these query languages leaves something to be desired. Breazu-Tannen, Buneman, and Wong 3] introduced a nested relational language NRC(=) based on monads 16, 24] and structur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 2014
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm137-1-8